Non-Redundant Dynamic Data Allocation in Distributed Database Systems

In the past few decades, the significant developments in database and networking technologies contributed to advances in distributed database systems (DDS). The data allocation is a prominent issue in distributed database systems and is performed on data access static and dynamic patterns. This paper proposes a new strategy named Extended Threshold Algorithm (ETA) for non-redundant dynamic data allocation in distributed database. The proposed algorithm is an extension of Threshold and Time Constraint Algorithm (TTCA) which was based on Optimal and Threshold algorithms. ETA performs relocation of data fragments with respect to changing access patterns to data fragments. It also reduces the space requirement and significantly improves the system performance.